Computability of discontinuous functions Functional space approach A gerenal report at Dagstuhl Seminar
نویسنده
چکیده
We are to discuss how to view notions of computability for discontinuous functions. We con ne ourselves to real-valued functions from some spaces. Our standpoint in studying computability problems in mathematics is doing mathematics. That is, we would like to talk about computable functions and other mathematical objects just as one talks about continuous functions, integrable functions, etc. In any naive notion of computability of a function (on a compact set), uniform continuity is inherent. On the other hand, one often approximates discontinuous functions, for instance in numerical computations and drawing graphs. Very often such approximations are successful and satisfactory. It is therefore meaningful and important to speculate on computability of discontinuous functions. According to our standpoint, it is a mathematical investigation to formulate computability of discontinuous functions and to nd out how it is related to some existing mathematical notions. One possible method of such investigations is to work in some theories of abstract spaces; for example, functional spaces such as Banach spaces and Frechet spaces, metric spaces, uniform topological spaces. The reason why such a method is e ective for the purpose is that an abstract theory of spaces supplies us with a logical framework for mathematics. A functional space is de ned axiomatically, and the objects which satisfy such axioms are those that are well-controlled.
منابع مشابه
Some properties of the e ectively uniform topological space
Our main objective is to investigate algorithmic features latent in some discontinuous functions in terms of uniform topological spaces. We develop the theory of computability structure and computable functions on a uniform topological space, and will apply the results to some real functions which are discontinuous in the Euclidean space.
متن کاملBidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121)
We provide a report on the Dagstuhl Seminar 13121: Bidimensional Structures: Algorithms, Combinatorics and Logic held at Schloss Dagstuhl in Wadern, Germany between Monday 18 and Friday 22 of March 2013. The report contains the motivation of the seminar, the abstracts of the talks given during the seminar, and the list of open problems. Seminar 18.–22. March, 2013 – www.dagstuhl.de/13121 1998 A...
متن کاملTowards an Affordable Internet Access for Everyone: The Quest for Enabling Universal Service Commitment (Dagstuhl Seminar 14471)
This report document the program and outcomes of the Dagstuhl Seminar 14471 Towards an Affordable Internet Access for Everyone: The Quest for Enabling Universal Service Commitment. At the seminar, about 27 invited researchers from academia and industry discussed the challenges and solutions for enabling universal and affordable Internet access. This report gives a general overview of the presen...
متن کاملComplexity of Boolean Functions Dagstuhl Seminar
From 12.03.06 to 17.03.06, the Dagstuhl Seminar 06111 Complexity of Boolean Functions was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results an...
متن کاملExponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331)
This report documents the program and the outcomes of Dagstuhl Seminar 13331 “Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time”. Problems are often solved in practice by algorithms with worst-case exponential time complexity. It is of interest to find the fastest algorithms for a given problem, be it polynomial, exponential, or something in between. The focus of the semi...
متن کامل